Spatial Joins and R-trees

One of the most important operations in spatial access needed systems are spatial joins. Using for processing such operations R-tree like structures is intensively studies now. The paper gives contemporary state in this research area and presents effective algorithm for spatial joins which combines both I/O and CPU cost optimization. This algorithm is designed like a multi-step process [4] and uses combination of the algorithms described in the previous paper [12]. Besides that several optimization of the basic R∗-tree algorithms and some spatial join heuristics are described to reduce CPU time. The experimental results and analysis of compared methods are presented.